منابع مشابه
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition systems. We lift the theory of parity automata to a coalgebraic level of abstraction by introducing, for a set Λ of predicate liftings associated with a set functor T , the notion of a Λ-automata operating on coalgebras...
متن کاملGlobal Predicate Detection under Fine-Grained Modalities
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global predicates can be specified. For a conjunctive predicate φ, we show how to detect the traditional Possibly(φ) and Definitely(φ) modalities along with the added information of the exact interaction type between each pair o...
متن کاملNabla discrete fractional calculus and nabla inequalities
Here we define a Caputo like discrete nabla fractional difference and we produce discrete nabla fractional Taylor formulae for the first time. We estimate their remaiders. Then we derive related discrete nabla fractional Opial, Ostrowski, Poincaré and Sobolev type inequalities .
متن کاملLiftings and Quasi-Liftings of DG Modules
We prove lifting results for DG modules that are akin to Auslander, Ding, and Solberg’s famous lifting results for modules. Introduction Convention. Throughout this paper, let R be a commutative noetherian ring. Hochster famously wrote that “life is really worth living” in a Cohen-Macaulay ring [7]. For instance, if R is Cohen-Macaulay and local with maximal regular sequence t, then R/(t) is ar...
متن کاملA Semantics for Nabla
We give a semantics for a classical variant of Dale Miller and Alwen Tiu’s logic FOλ∇. No such semantics seems to have existed for the nabla operator, except for one given by U. Schöpp. Our semantics validates the rule that nabla x implies exists x, but is otherwise faithful to the authors’ original intentions. The semantics is based on category of so-called nabla-sets, which we define as presh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.05.026